Robust perceptual coding of overcomplete frame expansions

نویسندگان

  • Javier Pinilla-Dutoit
  • Sandra I. Woolley
چکیده

The cortex transform provides a meaningful representation of images in terms of the responses of cortical cells. It is based on experimental results from human vision research. The multiple orientations obtained in the expansion are of interest for image analysis applications. In image coders, quantization can exploit to a large extent psychovisual properties. This transform belongs to a group of overcomplete transforms. This property has not benefited their use in coding applications. However, the inherent redundancy of overcomplete representations can be exploited to increase the robustness of the code. Multiple description coding of overcomplete expansions has been reported to confer more graceful degradation to partial reconstructions in the event of channel erasures. This paper proposes a coding strategy based on oriented transforms that yield perceptually meaningful coefficients. The coding budget is reduced by sampling and quantization. The remaining redundancy is used to provide robustness. In addition, the descriptions can be organized to allow progressive reconstruction. The tradeoff between quantization strength, perceived quality, redundancy and robustness can be incorporate in the design of the coder.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantization of Overcomplete Expansions

The use of overcomplete sets of vectors (redundant bases or frames) together with quantization is explored as an alternative to transform coding for signal compression. The goal is to retain the computational simplicity of transform coding while adding exibility like adaptation to signal statistics. We show results using both xed quantization in frames and greedy quantization using matching pur...

متن کامل

Frame Expansions Quantized with Permutation Codes

Quantized frame expansions are overcomplete representations of signals approximated by some quantizer. This scheme proved to be a very useful tool to combat quantization noise and erasures. Normally, a scalar quantizer is used in the quantization phase. In this paper we investigate the use of permutation codes, a beautiful source coding technique, as a quantizer. We explore consistent reconstru...

متن کامل

Multiple Description Decoding of Overcomplete Expansions Using Projections onto Convex Sets

This paper presents a POCS-based algorithm for consistent reconstruction of a signal x 2 R from any subset of quantized coe cients y 2 R in an N K overcomplete frame expansion y = Fx, N = 2K. By choosing the frame operator F to be the concatenation of two K K invertible transforms, the projections may be computed in R using only the transforms and their inverses, rather than in the larger space...

متن کامل

Quantization Design for Structured Overcomplete Expansions

The study of quantized overcomplete (redundant) expansions is relevant to severalimportant applications such as oversampled A/D conversion of band-limited sig-nals, multiple description quantization, joint source-channel coding and content-based retrieval for image databases. The problem of quantization of overcompleteexpansions is not as well understood as that of quantization ...

متن کامل

Quantized Overcomplete Expansions in IRN: Analysis, Synthesis, and Algorithms

Coefficient quantization has peculiar qualitative effects on representations of vectors in IR with respect to overcomplete sets of vectors. These effects are investigated in two settings: frame expansions (representations obtained by forming inner products with each element of the set) and matching pursuit expansions (approximations obtained by greedily forming linear combinations). In both cas...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001